Piecewise polyhedral formulations for a multilinear term
نویسندگان
چکیده
In this paper, we present a mixed-integer linear programming (MILP) formulation of piecewise, polyhedral relaxation (PPR) multilinear term using its convex-hull representation. Based on the PPR’s solution, also MILP whose solutions are feasible for nonconvex, equations. We then computational results showing effectiveness proposed formulations standard benchmark nonlinear programs (NLPs) with terms and compare traditional that is built recursive bilinear groupings terms.
منابع مشابه
Piecewise Polynomials on Polyhedral Complexes
For a d-dimensional polyhedral complex P , the dimension of the space of piecewise polynomial functions (splines) on P of smoothness r and degree k is given, for k sufficiently large, by a polynomial f(P, r, k) of degree d. When d = 2 and P is simplicial, in [1] Alfeld and Schumaker give a formula for all three coefficients of f . However, in the polyhedral case, no formula is known. Using loca...
متن کاملPiecewise Multilinear Sparse Grid Interpolation in MATLAB
To recover/approximate smooth multivariate functions, sparse grids are superior to full grids due to a significant reduction of the required support nodes. The order of the convergence rate in the maximum norm is hereby preserved up to a logarithmic factor. We describe three possible piecewise multilinear interpolation schemes in detail and conduct a numerical comparison. Furthermore, we summar...
متن کاملA polyhedral study of multilinear programs with box constraints
We study the polyhedral convex hull of a mixed-integer set S defined by a collection of multilinear equations of the form yI = ∏ i∈I xi over the 0−1-cube. Such sets appear frequently in the factorable reformulation of mixed-integer nonlinear optimization problems. In particular, the set S represents the feasible region of a linearized unconstrained zeroone polynomial optimization problem. We de...
متن کاملPolyhedral methods for piecewise-linear functions I: the lambda method
The \lambda method" is a well-known method for using integer linear-programming methods to model separable piecewise-linear functions in the context of optimization formulations. We extend the lambda method to the nonseparable case, and use polyhedral methods to strengthen the formulation.
متن کاملLocally ideal formulations for piecewise linear functions with indicator variables
In this paper, we consider mixed integer linear programming (MIP) formulations for piecewise linear functions (PLFs) that are evaluated when an indicator variable is turned on. We describe modifications to standard MIP formulations for PLFs with desirable theoretical properties and superior computational performance in this context. © 2013 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2021
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2020.12.002